منابع مشابه
Associativity of the Secant Method
1. INTRODUCTION. This paper has its genesis in a problem the author first came upon while in college. Although the areas covered here are well travelled and nothing here is guaranteed original, it covers a pleasant nexus of many mathematical strands. Furthermore, we show the value of good notation and of reading an old master for solving a problem. Consider iterates of the function m (x) = 1 I ...
متن کاملFaster Relief Mapping using the Secant Method
Relief mapping using the secant method offers an efficient method for adding per pixel height field based displacement to an arbitrary polygonal mesh in real time. The technique utilizes an interval based method in which bounds of the interval are computed in the beginning and are refined at every iteration until the intersection point is reached. The search space defined by the interval reduce...
متن کاملConvergence Conditions for the Secant Method
We provide new sufficient convergence conditions for the convergence of the Secant method to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses recurrent functions, Lipschitz–type and center–Lipschitz–type instead of just Lipschitz–type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise ...
متن کاملOn a Secant-like Method for Solving Generalized Equations
In the paper by Hilout and Piétrus (2006) a semilocal convergence analysis was given for the secant-like method to solve generalized equations using Hölder-type conditions introduced by the first author (for nonlinear equations). Here, we show that this convergence analysis can be refined under weaker hypothesis, and less computational cost. Moreover finer error estimates on the distances invol...
متن کاملA secant method for nonsmooth optimization
The notion of a secant for locally Lipschitz continuous functions is introduced and a new algorithm to locally minimize nonsmooth, nonconvex functions based on secants is developed. We demonstrate that the secants can be used to design an algorithm to find descent directions of locally Lipschitz continuous functions. This algorithm is applied to design a minimization method, called a secant met...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2013
ISSN: 0885-064X
DOI: 10.1016/j.jco.2013.04.001